Coalescing: Syntactic Abstraction for Reasoning in First-Order Modal Logics
نویسندگان
چکیده
We present a syntactic abstraction method to reason about first-order modal logics by using theorem provers for standard first-order logic and for propositional modal logic.
منابع مشابه
Modal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurrency. Modal logic is a well behaved subset of first-order logic; many variants...
متن کاملHigher Dimensional Modal Logic
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurrency. Modal logic is a well behaved subset of first-order logic; many variants...
متن کاملPreferential Reasoning for Modal Logics
Modal logic is the foundation for a versatile and well-established class of knowledge representation formalisms in artificial intelligence. Enriching modal logics with non-monotonic reasoning capabilities such as preferential reasoning as developed by Lehmann and colleagues would therefore constitute a natural extension of such KR formalisms. Nevertheless, there is at present no generally accep...
متن کاملFMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends
A converter from first-order modal logics to classical higherorder logic is presented. This tool enables the application of off-the-shelf higher-order theorem provers and model finders for reasoning within firstorder modal logics. The tool supports logics K, K4, D, D4, T, S4, and S5 with respect to constant, varying and cumulative domain semantics.
متن کاملModal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency [5, 8] that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or Petri nets. Modal logics, interpreted over Kripke structures, are the logics for reasoning about sequential behavior and interleaved concurrency. Modal logic is a well behaved subset of first-order logic; many v...
متن کامل